Rasterized Bounding Volume Hierarchies

نویسندگان

  • Jan Novák
  • Carsten Dachsbacher
چکیده

We present the rasterized bounding volume hierarchy (RBVH), a compact data structure that accelerates approximate ray casting of complex meshes and provides adjustable level of detail. During construction, we identify subtrees of BVHs containing surfaces that can be represented by height fields. For these subtrees the conventional ray-surface intersection, which possibly involves a large number of triangles, is replaced by a simple ray marching procedure to find the intersection with the surface. We describe GPU algorithms for construction, ray casting, and data querying of the RBVH that achieve comparable or higher performance than state of the art acceleration structures for triangle meshes. Moreover, RBVHs provide an inherent surface parameterization for storing data on the surfaces and natively handle triangle and point-based surface representations. We also show that RBVHs support adaptive level-of-detail and can be combined with traditional BVHs to handle complex scenes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Bounding Volume Hierarchy Generation Using Stochastic Search Methods

A bounding volume hierarchy is a common method for making ray tracing based rendering more efficient. Constructing good hierarchies, however, is a difficult problem as the number of hierarchies grows exponentially with the number of scene objects. In this paper, we attempted to apply stochastic search to techniques to solve the problem of automatic generation of bounding volume hierarchy. We ha...

متن کامل

A survey of algorithms for construction of optimal Heterogeneous Bounding Volume Hierarchies

In this paper we describe algorithms for automatic object hierarchy construction. We also describe a set of properties that hierarchies must possess to be considered optimal. Based on knowledge from existing algorithms we develop and evaluate a Branch and Bound construction algorithm that searches for good hierarchies, but due to computation time, not the globally optimal hierarchy. The algorit...

متن کامل

Efficient Bounding Volume Hierarchies for Hair Simulation

We study the practicability and performance of different classes of bounding volume hierarchies for self collision detection in complex human hair styles with authentic geometrical properties. In particular, we focus on topology based hierarchies which allow for fast update schemes as well as conventional spatially adapted hierarchies. In this context, we introduce a parameterized k-DOP approac...

متن کامل

Using Projection to Accelerate Ray Tracing

Using Projection to accelerate Ray Tracing Anastasia Bezerianos M.Sc. Graduate Department of Computer Science University of Toronto 2001 The high cost of Ray Tracing image rendering has driven many researchers to devise acceleration techniques like bounding volume hierarchies. This thesis introduces new ways of building bounding volume hierarchies. We modify existing algorithms to use bounding ...

متن کامل

Ray Tracing with the Single Slab Hierarchy

Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2012